The Analytic Principle of the Large Sieve by Hugh L. Montgomery
نویسندگان
چکیده
E. Bombieri [12] has written at length concerning applications of the large sieve to number theory. Our intent here is to complement his exposition by devoting our attention to the analytic principle of the large sieve; we describe only briefly how applications to number theory are made. The large sieve was studied intensively during the decade 1965-1975, with the result that the subject has lost its mystery: We now possess a variety of simple ideas which provide very precise results and a host of variants. While the large sieve can no longer be considered deep, it nevertheless gives powerful estimates in many different settings.
منابع مشابه
The Principle of the Large Sieve
We describe a very general abstract form of sieve based on a large-sieve inequality which generalizes both the classical sieve inequality of Montgomery (and its higher-dimensional variants), and our recent sieve for Frobenius over function fields. The general framework suggests new applications. We give some first results on the number of prime divisors of “most” elements of an elliptic divisib...
متن کاملHarmonic Analysis as found in Analytic Number Theory
A wide variety of questions of Harmonic Analysis arise naturally in various contexts of Analytic Number Theory; in what follows we consider a number of examples of this type. The author is grateful to Dr. Ulrike Vorhauer for advice and assistance at all stages of preparation of this paper.
متن کاملOn variants of the larger sieve
The large sieve has its origins in the work of Linnik and Rényi. It was developed to deal with sequences that avoid a positive proportion of residue classes. It was later simplified by Roth, Bombieri, Davenport, Halberstam, Montgomery, Gallagher and many others. For a survey see Montgomery [12] and Bombieri [1]. It is known that Montgomery’s large sieve [12] is a useful method when sifting sequ...
متن کاملAn explicit sieve bound and small values of σ(ф(m))
We prove an explicit sieve upper bound based on the large sieve of Montgomery and Vaughan [MV], and apply it to show that σ(φ(m)) > m/39.4 for all positive integers m.
متن کاملThe Multiple Polynomial Quadratic Sieve
A modification, due to Peter Montgomery, of Pomerance's Quadratic Sieve for factoring large integers is discussed along with its implementation. Using it, allows factorization with over an order of magnitude less sieving than the basic algorithm. It enables one to factor numbers in the 60-digit range in about a day, using a large minicomputer. The algorithm has features which make it well adapt...
متن کامل